Computing Forgotten Topological Index of Extremal Cactus Chains

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the forgotten topological index

The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.

متن کامل

Computing the extremal index of special Markov chains and queues

A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-Abstract We consider the extremal behaviour of Markov chains. Rootz en 18] gives conditions for stationary, regenerative sequences so that the normalized process of level exceedances converges in distribution to a compound Poisson process. He also provides expressions for the extremal index and the compo...

متن کامل

Extremal Polyomino Chains of VDB Topological Indices

We show that the zig-zag chain Z3 n of segments of length 3 (see Figure 2) has the minimal ABC index among all polyomino chains with n squares. More generally, we give conditions on the numbers {φij} under which the zig-zag chain Z3 n is an extremal value of the induced topological index T defined by T (G) = ∑ 1≤i≤j≤n−1 mijφij where G is a graph with n vertices and mij is the number of edges of...

متن کامل

The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...

متن کامل

On the bounds of the forgotten topological index

The forgotten topological index is defined as the sum of cubes of the degrees of the vertices of the molecular graph G. In this paper, we obtain, analyze, and compare various lower bounds for the forgotten topological index involving the number of vertices, edges, and maximum and minimum vertex degree. Then we give Nordhaus–Gaddumtype inequalities for the forgotten topological index and coindex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Nonlinear Sciences

سال: 2020

ISSN: 2444-8656

DOI: 10.2478/amns.2020.2.00075